Uniqueness below a cut-off frequency for the two-dimensional linear water-wave problem
نویسندگان
چکیده
منابع مشابه
Uniqueness below a cut-off frequency for the two-dimensional linear water-wave problem
The two-dimensional velocity potential associated with the scattering of linear waves in water of finite but non-uniform depth is shown to be unique for Khmax ≤ 1. Here hmax is the maximum depth of the fluid and K = ω2/g, where ω is the angular frequency and g is the acceleration due to gravity. Uniqueness is established by proving that the homogeneous boundary value problem for the velocity po...
متن کاملOptimal High Frequency Cut-off in SWAN Wave Model
This study investigates the importance of selecting an appropriate cut-off frequency in the SWAN model when it is applied to areas with limited fetches. In SWAN, the cut-off frequency is a constant value set by user in the model, and its appropriate selection plays an important role in the accuracy and optimization of the wave model; very high value increases the computational cost and might le...
متن کاملDifferential Transform Method to two-dimensional non-linear wave equation
In this paper, an analytic solution is presented using differential transform method (DTM) for a class of wave equation. The emphasis is on the nonlinear two-dimensional wave equation. The procedures introduced in this paper are in recursive forms which can be used to obtain the closed form of the solutions, if they are required. The method is tested on various examples, and the results reveal ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
سال: 1999
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.1999.0367